Approximating independent set in perturbed graphs
نویسندگان
چکیده
منابع مشابه
Approximating independent set in perturbed graphs
For the maximum independent set problem, strong inapproximability bounds for worst-case efficient algorithms exist. We give a deterministic algorithm beating these bounds, with polynomial expected running-time for semi-random graphs: An adversary chooses a graph with n vertices, and then edges are flipped with a probability of ε. Our algorithm guarantees an approximation ratio of O( √ nε) for s...
متن کاملApproximating the Minimum Independent Dominating Set in Perturbed Graphs
We investigate the minimum independent dominating set in perturbed graphs g(G, p) of input graph G = (V,E), obtained by negating the existence of edges independently with a probability p > 0. The minimum independent dominating set (MIDS) problem does not admit a polynomial running time approximation algorithm with worst-case performance ratio of n1− for any > 0. We prove that the size of the mi...
متن کاملApproximating Independent Set in Semi-Random Graphs
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipped independently with a probability of ε > 0. Our algorithm runs in expected polynomial time and guarantees an approximation ratio of roughly O( √ nε), which beats the inapproximability bounds.
متن کاملApproximating independent sets in sparse graphs
We consider the maximum independent set problem on sparse graphs with maximum degree d. The best known result for the problem is an SDP based O(d log log d/ log d) approximation due to Halperin. It is also known that no o(d/ log d) approximation exists assuming the Unique Games Conjecture. We show the following two results: (i) The natural LP formulation for the problem strengthened by O(log(d)...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.06.008